Longest path partitions in generalizations of tournaments
نویسندگان
چکیده
منابع مشابه
Longest path partitions in generalizations of tournaments
We consider the so-called Path Partition Conjecture for digraphs which states that for every digraph, D, and every choice of positive integers, λ1, λ2, such that λ1 + λ2 equals the order of a longest directed path in D, there exists a partition of D into two digraphs, D1 and D2, such that the order of a longest path in Di is at most λi, for i = 1, 2. We prove that certain classes of digraphs, w...
متن کاملThe Path Partition Conjecture is true in generalizations of tournaments
The Path Partition Conjecture for digraphs states that for every digraph D, and every choice of positive integers λ1, λ2 such that λ1 + λ2 equals the order of a longest directed path in D, there exists a partition of D in two subdigraphs D1,D2 such that the order of the longest path in Di is at most λi for i = 1, 2. We present sufficient conditions for a digraph to satisfy the Path Partition Co...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملGeneralizations of tournaments: A survey
We survey results concerning various generalizations of tournaments. The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. We describe, among numerous other topics mostly related to paths and cycles, results on hamiltonian paths and cycles. The reader will see that although these problems are polynomially solvable for all of the class...
متن کاملk-Colour Partitions of Acyclic Tournaments
Let G1 be the acyclic tournament with the topological sort 0 < 1 < 2 < · · · < n < n + 1 defined on node set N ∪ {0, n + 1}, where N = {1, 2, . . . , n}. For integer k ≥ 2, let Gk be the graph obtained by taking k copies of every arc in G1 and colouring every copy with one of k different colours. A k-colour partition of N is a set of k paths from 0 to n + 1 such that all arcs of each path have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.03.063